func github.com/andybalholm/brotli.buildAndStoreHuffmanTreeFast

7 uses

	github.com/andybalholm/brotli (current package)
		brotli_bit_stream.go#L447: func buildAndStoreHuffmanTreeFast(histogram []uint32, histogram_total uint, max_bits uint, depth []byte, bits []uint16, storage_ix *uint, storage []byte) {
		brotli_bit_stream.go#L1470: 		buildAndStoreHuffmanTreeFast(histogram[:], num_literals, /* max_bits = */
		brotli_bit_stream.go#L1490: 		buildAndStoreHuffmanTreeFast(lit_histo.data_[:], lit_histo.total_count_, /* max_bits = */
		brotli_bit_stream.go#L1493: 		buildAndStoreHuffmanTreeFast(cmd_histo.data_[:], cmd_histo.total_count_, /* max_bits = */
		brotli_bit_stream.go#L1496: 		buildAndStoreHuffmanTreeFast(dist_histo.data_[:], dist_histo.total_count_, /* max_bits = */
		compress_fragment.go#L84: 	buildAndStoreHuffmanTreeFast(histogram[:], histogram_total, /* max_bits = */
		compress_fragment_two_pass.go#L635: 	buildAndStoreHuffmanTreeFast(lit_histo[:], num_literals, /* max_bits = */